Routing algorithms

Results: 695



#Item
61Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Overlays with preferences: Approximation algorithms for matching with preference lists Giorgos Georgiadis Department of Computer Science and Engineering Chalmers University of Technology SG¨oteborg, Sweden

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2011-05-18 09:50:44
62Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Challenges in Selecting Paths for Navigational Queries: Trade-Off of Benefit of Path versus Cost of Plan Mar´ıa-Esther Vidal Louiqa Raschid

Add to Reading List

Source URL: webdb2004.cs.columbia.edu

Language: English - Date: 2004-05-31 19:36:24
63Microsoft Word - PhD position multipath networks 2016 en.docx

Microsoft Word - PhD position multipath networks 2016 en.docx

Add to Reading List

Source URL: icube-reseaux.unistra.fr

Language: English - Date: 2016-04-18 17:34:23
64Time-of-Flight Aware Time Synchronization for Wireless Embedded Systems Roman Lim, Balz Maag, Lothar Thiele Computer Engineering and Networks Laboratory ETH Zurich, Switzerland

Time-of-Flight Aware Time Synchronization for Wireless Embedded Systems Roman Lim, Balz Maag, Lothar Thiele Computer Engineering and Networks Laboratory ETH Zurich, Switzerland

Add to Reading List

Source URL: people.ee.ethz.ch

Language: English - Date: 2016-02-18 13:15:48
65Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Simpler and Better Approximation Algorithms for Network Design Anupam Gupta∗ Amit Kumar†

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2005-11-30 21:17:11
66Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary

Bandit based Monte-Carlo Planning Levente Kocsis and Csaba Szepesv´ari Computer and Automation Research Institute of the Hungarian Academy of Sciences, Kende u, 1111 Budapest, Hungary

Add to Reading List

Source URL: ggp.stanford.edu

Language: English - Date: 2009-04-20 18:54:11
67Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke  Albert-Ludwigs-Universit¨at Freiburg

Enabling E-Mobility: Facility Location for Battery Loading Stations Sabine Storandt Stefan Funke Albert-Ludwigs-Universit¨at Freiburg

Add to Reading List

Source URL: ad-publications.informatik.uni-freiburg.de

Language: English - Date: 2013-04-29 10:40:39
68Équipe Network Research Group Sujet IP graph models & Routing Thesis subject 2014

Équipe Network Research Group Sujet IP graph models & Routing Thesis subject 2014

Add to Reading List

Source URL: icube-reseaux.unistra.fr

Language: English - Date: 2013-03-27 10:28:03
69Sensor Localization with Deterministic Accuracy Guarantee Ryo Sugihara Rajesh K. Gupta

Sensor Localization with Deterministic Accuracy Guarantee Ryo Sugihara Rajesh K. Gupta

Add to Reading List

Source URL: mesl.ucsd.edu

Language: English - Date: 2011-04-30 19:20:57
70Microsoft Word - technical_report_2009_06.doc

Microsoft Word - technical_report_2009_06.doc

Add to Reading List

Source URL: www.cse.chalmers.se

Language: English - Date: 2009-05-11 07:23:08